Process Algebra
نویسندگان
چکیده
Process algebra represents a mathematically rigorous framework for modeling concurrent systems of interacting processes. The process-algebraic approach relies on equational and inequational reasoning as the basis for analyzing the behavior of such systems. This chapter surveys some of the key results obtained in the area within the setting of a particular process-algebraic notation, the Calculus of Communicating Systems (CCS) of Milner. In particular, the Structural Operational Semantics approach to deening operational behavior of languages is illustrated via CCS, and several operational equivalences and reenement orderings are discussed. Mechanisms are presented for deducing that systems are related by the equivalence relations and reenement or-derings, and diierent process-algebraic modeling formalisms are brieey surveyed.
منابع مشابه
New Solutions for Fokker-Plank Equation of Special Stochastic Process via Lie Point Symmetries
In this paper Lie symmetry analysis is applied in order to find new solutions for Fokker Plank equation of Ornstein-Uhlenbeck process. This analysis classifies the solutions format of the Fokker Plank equation by using the Lie algebra of the symmetries of our considered stochastic process.
متن کاملProcess algebraic modeling of authentication protocols for analysis of parallel multi-session executions
Many security protocols have the aim of authenticating one agent acting as initiator to another agent acting as responder and vice versa. Sometimes, the authentication fails because of executing several parallel sessions of a protocol, and because an agent may play both the initiator and responder role in parallel sessions. We take advantage of the notion of transition systems to specify authen...
متن کاملStochastic Process Algebra with Value-Passing and Weak Time Restrictions
Process algebra provides essential tools for studying distributed and concurrent systems. Stochastic process algebra (i.e., YAWN ) enhances the process algebra with stochastic extensions which is perfect to analyze phenomena of process with executing durations in the real world. What’s more, in system runs, value passing is tightly bounded with their processes. However, stochastic process algeb...
متن کاملProcess algebra for hybrid systems
We propose a process algebra obtained by extending a combination of the process algebra with continuous relative timing from Baeten and Middelburg [Process Algebra with Timing, Springer, Chap. 4, 2002] and the process algebra with propositional signals from Baeten and Bergstra [Theoretical Computer Science 177:381–405, 1997]. The proposed process algebra makes it possible to deal with the behav...
متن کاملTowards Executable Business Processes with the Problem Oriented Engineering Process Algebra
The paper introduces a process algebra for business process models. The algebra is located within Problem Oriented Engineering, a framework for engineering design, and is based on a process pattern defined by Hall and Rapanotti by which Problem Oriented Engineering developments should be structured. The pattern is a generator for processes being composable in three ways: in sequence, in paralle...
متن کاملNew three-step iteration process and fixed point approximation in Banach spaces
In this paper we propose a new iteration process, called the $K^{ast }$ iteration process, for approximation of fixed points. We show that our iteration process is faster than the existing well-known iteration processes using numerical examples. Stability of the $K^{ast}$ iteration process is also discussed. Finally we prove some weak and strong convergence theorems for Suzuki ge...
متن کامل